منابع مشابه
Rendezvous with constant memory
We study the impact that persistent memory has on the classical rendezvous problem of two mobile computational entities, called robots, in the plane. It is well known that, without additional assumptions, rendezvous is impossible if the entities are oblivious (i.e., have no persistent memory) even if the system is semi-synchronous (SSynch). It has been recently shown that rendezvous is possible...
متن کاملDeterministic Rendezvous in Trees with Little Memory
We study the size of memory of mobile agents that permits to solve deterministically the rendezvous problem, i.e., the task of meeting at some node, for two identical agents moving from node to node along the edges of an unknown anonymous connected graph. The rendezvous problem is unsolvable in the class of arbitrary connected graphs, as witnessed by the example of the cycle. Hence we restrict ...
متن کاملRendezvous of Two Robots with Constant Memory
We study the impact that persistent memory has on the classical rendezvous problem of two mobile computational entities, called robots, in the plane. It is well known that, without additional assumptions, rendezvous is impossible if the entities are oblivious (i.e., have no persistent memory) even if the system is semi-synchronous (SSynch). It has been recently shown that rendezvous is possible...
متن کاملPlayers With Limited Memory
This paper studies a model of memory. The model takes into account that memory capacity is limited and imperfect. We study how agents with such memory limitations, who have very little information about their choice environment, play games. We introduce the notion of a Limited Memory Equilibrium (LME) and show that play converges to an LME in every generic normal form game. Our characterization...
متن کاملSequential Detection with Limited Memory
Sequential tests outperform fixed sample size tests by requiring fewer samples on average to achieve the same level of error performance. The Sequential Probability Ratio Test (SPRT) has been suggested by Wald [1] for sequential binary hypothesis testing problems. SPRT recursively calculates the likelihood of an observed data stream and requires this likelihood to be stored in memory between sa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2011
ISSN: 1549-6325,1549-6333
DOI: 10.1145/1978782.1978789